"Moore graph" meaning in English

{
  "etymology_text": "Named in 1960 by Hoffman and Singleton, after Edward F. Moore, who posed the question of describing and classifying these graphs.",
  "forms": [
    {
      "form": "Moore graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Moore graph (plural Moore graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ."
      ],
      "id": "en-Moore_graph-en-noun-zV~och9T",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "regular",
          "regular"
        ],
        [
          "degree",
          "degree"
        ],
        [
          "diameter",
          "diameter"
        ],
        [
          "vertices",
          "vertex"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Edward F. Moore"
      ]
    }
  ],
  "word": "Moore graph"
}

{
  "etymology_text": "Named in 1960 by Hoffman and Singleton, after Edward F. Moore, who posed the question of describing and classifying these graphs.",
  "forms": [
    {
      "form": "Moore graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Moore graph (plural Moore graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "glosses": [
        "A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "regular",
          "regular"
        ],
        [
          "degree",
          "degree"
        ],
        [
          "diameter",
          "diameter"
        ],
        [
          "vertices",
          "vertex"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A regular graph of degree d and diameter k whose number of vertices equals the upper bound 1+d∑ᵢ₌₀ᵏ⁻¹(d-1)ⁱ."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Edward F. Moore"
      ]
    }
  ],
  "word": "Moore graph"
}